Development of Transformation Functions Assisted by a Theorem Prover
نویسندگان
چکیده
Transformational approach requires to write transformation functions that ensure properties C1 and C2. Proving these conditions on complex typed objects is a serious bottleneck for the application of this approach. We propose to use a theorem prover to assist the development of safe transformation functions. In this paper, we present how we have designed in that way a set of safe transformation functions for an XML typed object.
منابع مشابه
More About TAS and IsaWin - Tools for Formal Program Development
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theorem prover Isabelle [8], which is used as a generic logical framework here. A graphical user interface, based on the principle of direct manipulation, allows the user to interact with the tool without having to concer...
متن کاملProving Correctness of Transformation Functions Functions in Real-Time Groupware
Operational transformation is an approach which allows to build real-time groupware tools. This approach requires correct transformation functions. Proving the correction of these transformation functions is very complex and error prone. In this paper, we show how a theorem prover can address this serious bottleneck. To validate our approach, we have verified the correctness of state-of-art tra...
متن کاملProving Correctness of Transformation Functions in Real-Time Groupware
Operational transformation is an approach which allows to build real-time groupware tools. This approach requires correct transformation functions. Proving the correction of these transformation functions is very complex and error prone. In this paper, we show how a theorem prover can address this serious bottleneck. To validate our approach, we have verified the correctness of state-of-art tra...
متن کاملWSDFU: Program Transformation System Based on Generalized Partial Computation
Generalized Partial Computation (GPC) is a program transformation method utilizing partial information about input data and auxiliary functions as well as the logical structure of a source program. GPC uses both an inference engine such as a theorem prover and a classical partial evaluator to optimize programs. Therefore, GPC is more powerful than classical partial evaluators but harder to impl...
متن کاملUsing the Theorem Prover
This paper describes experiments with the automated theorem prover SETHEO. The prover is applied to proof tasks which arise during formal design and speciication in Focus. These proof tasks originate from the formal development of a communication protocol (Stenning protocol). Its development and veriication in Focus is described in \C. Dendorfer, R. Weber: Development and Implementation of a Co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002